A Continuum - Tree - Valued Markov Process
نویسندگان
چکیده
We present a construction of a Lévy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov theorem. We also extend the pruning procedure to this super-critical case. Let ψ be a critical branching mechanism. We set ψθ(·) = ψ(·+ θ)− ψ(θ). Let Θ = (θ∞,+∞) or Θ = [θ∞,+∞) be the set of values of θ for which ψθ is a conservative branching mechanism. The pruning procedure allows to construct a decreasing Lévy-CRT-valued Markov process (Tθ, θ ∈Θ), such that Tθ has branching mechanism ψθ. It is sub-critical if θ > 0 and super-critical if θ < 0. We then consider the explosion time A of the CRT: the smallest (negative) time θ for which the continuous state branching process (CB) associated with Tθ has finite total mass (i.e., the length of the excursion of the exploration process that codes the CRT is finite). We describe the law of A as well as the distribution of the CRT just after this explosion time. The CRT just after explosion can be seen as a CRT conditioned not to be extinct which is pruned with an independent intensity related to A. We also study the evolution of the CRT-valued process after the explosion time. This extends results from Aldous and Pitman on Galton–Watson trees. For the particular case of the quadratic branching mechanism, we show that after explosion the total mass of the CB behaves like the inverse of a stable subordinator with index 1/2. This result is related to the size of the tagged fragment for the fragmentation of Aldous’s CRT.
منابع مشابه
Subtree prune and regraft: a reversible real tree-valued Markov process
We use Dirichlet form methods to construct and analyze a reversible Markov process, the stationary distribution of which is the Brownian continuum random tree. This process is inspired by the subtree prune and re-graft (SPR)Markov chains that appear in phylogenetic analysis. A key technical ingredient in this work is the use of a novel Gromov– Hausdorff type distance to metrize the space whose ...
متن کاملA line-breaking construction of the stable trees
We give a new, simple construction of the α-stable tree for α ∈ (1, 2]. We obtain it as the closure of an increasing sequence of R-trees inductively built by gluing together line-segments one by one. The lengths of these line-segments are related to the the increments of an increasing R+-valued Markov chain. For α = 2, we recover Aldous’ line-breaking construction of the Brownian continuum rand...
متن کاملInhomogeneous continuum random trees and the entrance boundary of the additive coalescent
Abstract. Regard an element of the set of ranked discrete distributions := {(x1, x2, . . .) : x1 ≥ x2 ≥ . . . ≥ 0, ∑ i xi = 1} as a fragmentation of unit mass into clusters of masses xi . The additive coalescent is the -valued Markov process in which pairs of clusters of masses {xi, xj }merge into a cluster of mass xi+xj at rate xi+xj . Aldous and Pitman (1998) showed that a version of this pro...
متن کاملTree-valued Markov Chains Derived from Galton-watson Processes
Let G be a Galton-Watson tree, and for 0 u 1 let Gu be the subtree of G obtained by retaining each edge with probability u. We study the tree-valued Markov process (Gu; 0 u 1) and an analogous process (G u; 0 u 1) in which G 1 is a critical or subcritical Galton-Watson tree conditioned to be in nite. Results simplify and are further developed in the special case of Poisson( ) o spring distribut...
متن کاملM. Jean-François DELMAS directeur de thèse
In this thesis, we study continuum tree-valued processes. First, we define anabstract framework for these processes, by constructing a metric on the space of locally com-pact, complete R-trees, endowed with a locally finite Borel measure. This topology, calledGromov-Hausdorff-Prokhorov topology, allows for the definition of tree-valued Markov pro-cesses. We then give a new const...
متن کامل